Progressive Solutions to FSM Equations
نویسندگان
چکیده
The equation solving problem is to derive the behavior of the unknown component X knowing the joint behavior of the other components (or the context) C and the specification of the overall system S. The component X can be derived by solving the Finite State Machine (FSM) equation C ◊ X ∼ S, where ◊ is the parallel composition operator and ∼ is the trace equivalence or the trace reduction relation. A solution X to an FSM equation is called progressive if for every external input sequence the composition C ◊ X does not fall into a livelock without an exit. In this paper, we formally define the notion of a progressive solution to a parallel FSM equation and present an algorithm that derives a largest progressive solution (if a progressive solution exists). In addition, we generalize the work to a system of FSM equations. Application examples are provided.
منابع مشابه
Compositionally Progressive Solutions of Synchronous Language Equations
The paper addresses the problem of designing a component that combined with a known part of a system, called the context FSM, is a reduction of a given specification FSM. We study compositionally progressive solutions of synchronous FSM equations. Such solutions, when combined with the context, do not block any input that may occur in the specification, so they are of practical use. We show tha...
متن کاملCompositionally Progressive Solutions of Synchronous FSM Equations
The paper addresses the problem of designing a component that combined with a known part of a system, called the context FSM, is a reduction of a given specification FSM. We study compositionally progressive solutions of synchronous FSM equations. Such solutions, when combined with the context, do not block any input that may occur in the specification, so they are of practical use. We show tha...
متن کاملSequential Synthesis by Language Equation Solving
Consider the problem of designing a component that combined with a known part of a system, called the context, conforms to a given overall specification. This question arises in several applications ranging from logic synthesis to the design of discrete controllers. We cast the problem as solving abstract equations over languages and study the most general solutions under the synchronous and pa...
متن کاملFSM Re-Engineering for Low Power State Encoding
Finite State Machine (FSM) synthesis traditionally starts with state minimization and state encoding, which provide codes of minimal length to the FSM with minimal number of states. Recently, there have been studies on encoding with nonminimal length and synthesis on non-minimized FSM. In this paper, we propose the framework of FSM re-engineering, which starts with synthesizing the original FSM...
متن کاملEffect of Material Gradient on Stresses of Thick FGM Spherical Pressure Vessels with Exponentially-Varying Properties
Using the Frobenius series method (FSM), an analytical solution is developed to obtain mechanical stresses of thick spherical pressure vessels made of functionally graded materials (FGMs). The cylinder pressure vessel is subjected to uniform internal pressure. The modulus of elasticity is graded along the radial direction according to power functions of the radial direction. It is assumed that ...
متن کامل